On Weighted Mean Convergence of Lagrange Interpolation for General Arrays

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Weighted Mean Convergence of Lagrange Interpolation for General Arrays

For n 1, let fxjngnj=1 be n distinct points and let Ln[ ] denote the corresponding Lagrange Interpolation operator. Let W : R ! [0;1). What conditions on the array fxjng1 j n; n 1 ensure the existence of p > 0 such that lim n!1 k (f Ln[f ])W b kLp(R)= 0 for every continuous f : R ! Rwith suitably restricted growth, and some “weighting factor” ? We obtain a necessary and su¢ cient condition for ...

متن کامل

On Mean Convergence of Lagrange Interpolation for General Arrays

For n 1, let fxjngnj=1 be n distinct points in a compact set K R and let Ln[ ] denote the corresponding Lagrange Interpolation operator. Let v be a suitably restricted function on K. What conditions on the array fxjng1 j n; n 1 ensure the existence of p > 0 such that lim n!1 k (f Ln[f ]) v kLp(K)= 0 for every continuous f :: K ! R ? We show that it is necessary and su cient that there exists r ...

متن کامل

On quadrature convergence of extended Lagrange interpolation

Quadrature convergence of the extended Lagrange interpolant L2n+1f for any continuous function f is studied, where the interpolation nodes are the n zeros τi of an orthogonal polynomial of degree n and the n+ 1 zeros τ̂j of the corresponding “induced” orthogonal polynomial of degree n + 1. It is found that, unlike convergence in the mean, quadrature convergence does hold for all four Chebyshev w...

متن کامل

Convergence of Extended Lagrange Interpolation

The authors give a procedure to construct extended interpolation formulae and prove some uniform convergence theorems.

متن کامل

Intertwining unisolvent arrays for multivariate Lagrange interpolation

Let Pd(C ) denote the space of polynomials of degree at most d in n complex variables. A subset X of C – we will usually speak of configuration or array – is said to be unisolvent for Pd(C ) (or simply unisolvent of degree d) if, for every function f defined on X there exists a unique polynomial P ∈ Pd(C ) such that P(x) = f (x) for every x ∈ X. This polynomial is called the Lagrange interpolat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 2002

ISSN: 0021-9045

DOI: 10.1006/jath.2002.3698